Best monotone degree conditions for binding number
نویسندگان
چکیده
We give sufficient conditions on the vertex degrees of a graph G to guarantee that G has binding number at least b, for any given b > 0. Our conditions are best possible in exactly the same way that Chvátal’s well-known degree condition to guarantee a graph is hamiltonian is best possible.
منابع مشابه
Sufficient degree conditions for k-edge-connectedness of a graph
One of Frank Boesch’s best known papers is ‘The strongest monotone degree conditions for n-connectedness of a graph’ [1]. In this paper, we give a simple sufficient degree condition for a graph to be k-edge-connected, and also give the strongest monotone condition for a graph to be 2-edge-connected.
متن کاملBest Monotone Degree Bounds for Various Graph Parameters
We identify best monotone degree bounds for the chromatic number and independence number of a graph. These bounds are best in the same sense as Chvátal’s hamiltonian degree condition. 1 Terminology and Notation We consider only undirected graphs without loops or multiple edges. Our terminology and notation will be standard except as indicated, and a good reference for any undefined terms is [14...
متن کاملDegree Sequences and the Existence of k-Factors
We consider sufficient conditions for a degree sequence π to be forcibly k-factor graphical. We note that previous work on degrees and factors has focused primarily on finding conditions for a degree sequence to be potentially k-factor graphical. We first give a theorem for π to be forcibly 1-factor graphical and, more generally, forcibly graphical with deficiency at most β ≥ 0. These theorems ...
متن کاملno-homomorphism conditions for hypergraphs
In this paper, we define some new homomorphism-monotone parameters for hypergraphs. Using these parameters, we extend some graph homomorphism results to hypergraph case. Also, we present some bounds for some well-known invariants of hypergraphs such as fractional chromatic number,independent numer and some other invariants of hyergraphs, in terms of these parameters.
متن کاملContinuous dependence on coefficients for stochastic evolution equations with multiplicative Levy Noise and monotone nonlinearity
Semilinear stochastic evolution equations with multiplicative L'evy noise are considered. The drift term is assumed to be monotone nonlinear and with linear growth. Unlike other similar works, we do not impose coercivity conditions on coefficients. We establish the continuous dependence of the mild solution with respect to initial conditions and also on coefficients. As corollaries of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 311 شماره
صفحات -
تاریخ انتشار 2011